The structure of tail-biting trellises: minimality and basic principl
نویسندگان
چکیده
Basic structural properties of tail-biting trellises are investigated. We start with rigorous definitions of various types of minimality for tail-biting trellises. We then show that biproper and/or nonmergeable tail-biting trellises are not necessarily minimal, even though every minimal tail-biting trellis is biproper. Next, we introduce the notion of linear (or group) trellises and prove, by example, that a minimal tail-biting trellis for a binary linear code need not have any linearity properties whatsoever. We observe that a trellis—either tail-biting or conventional—is linear if and only if it factors into a product of elementary trellises. Using this result, we show how to construct, for any given linear code , a tail-biting trellis that minimizes the product of state-space sizes among all possible linear tail-biting trellises. We also prove that every minimal linear tail-biting trellis for arises from a certain characteristic matrix, and show how to compute this matrix in time ( ) from any basis for . Furthermore, we devise a linear-programming algorithm that starts with the characteristic matrix and produces a linear tail-biting trellis for which minimizes the maximum state-space size. Finally, we consider a generalized product construction for tail-biting trellises, and use it to prove that a linear code and its dual have the same state-complexity profiles.
منابع مشابه
Tail-biting Trellises for Linear Codes and their Duals
Trellis representations of linear block codes are attractive because of their use in soft decision decoding algorithms. An interesting property that is known for conventional trellises is that the minimal conventional trellis (known to be unique) for a linear block code, and its dual have the same state-complexity profile. This interesting property follows from the BCJR construction [1] of the ...
متن کاملTrellis Representations for Linear Block Codes
Trellis Representations for Linear Block Codes Heide Gluesing-Luerssen University of Kentucky Department of Mathematics 715 Patterson Office Tower Lexington, KY 40506 USA During the last decade conventional and tail-biting trellis representations of linear block codes have gained a great deal of attention. A tail-biting trellis for a block code of length n is an edge-labeled layered graph on th...
متن کاملOn the Theory of Linear Trellises
Trellis linearity, rst considered by McEliece in 1996, turns out to be crucial in the study of tail-biting trellises. In this chapter, basic structural properties of linear trellises are investigated. A rigorous deeni-tion of linearity is given for both conventional and tail-biting trellises. An algorithm that determines in polynomial time whether a given trellis is linear is then derived. The ...
متن کاملUnifying Views of Tail-Biting Trellises for Linear Block Codes
This thesis presents new techniques for the construction and specification of linear tail-biting trellises. Tail-biting trellises for linear block codes are combinatorial descriptions in the form of layered graphs, that are somewhat more compact than the corresponding conventional trellis descriptions. Conventional trellises for block codes have a well understood underlying theory. On the other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2003